Interval-Vector Polytopes
نویسندگان
چکیده
An interval vector is a (0, 1)-vector where all the ones appear consecutively. Polytopes whose vertices are among these vectors have some astonishing properties that are highlighted in this paper. We present a number of interval-vector polytopes, including one class whose volumes are the Catalan numbers and another class whose face numbers mirror Pascal’s triangle.
منابع مشابه
The Combinatorics of Interval Vector Polytopes
An interval vector is a (0, 1)-vector in Rn for which all the 1’s appear consecutively, and an interval-vector polytope is the convex hull of a set of interval vectors in Rn. We study three particular classes of interval vector polytopes which exhibit interesting geometric-combinatorial structures; e.g., one class has volumes equal to the Catalan numbers, whereas another class has face numbers ...
متن کاملVector Spaces Spanned by the Angle Sums of Polytopes
This paper describe the spaces spanned by the angle sums of certain classes of polytopes, as recorded in the α-vector. Families of polytopes are constructed whose angle sums span the spaces of polytopes defined by the Gram and Perles equations, analogs of the Euler and Dehn-Sommerville equations. This shows that the dimension of the affine span of the space of angle sums of simplices is ⌊ d−1 2...
متن کاملAn Upper Bound Theorem concerning lattice polytopes
R. P. Stanley proved the Upper Bound Conjecture in 1975. We imitate his proof for the Ehrhart rings. We give some upper bounds for the volume of integrally closed lattice polytopes. We derive some inequalities for the delta-vector of integrally closed lattice polytopes. Finally we apply our results for reflexive integrally closed and order polytopes.
متن کاملA Combinatorial Study of Multiplexes and Ordinary Polytopes
Bisztriczky defines a multiplex as a generalization of a simplex, and an ordinary polytope as a generalization of a cyclic polytope. This paper presents results concerning the combinatorics of multiplexes and ordinary polytopes. The flag vector of the multiplex is computed, and shown to equal the flag vector of a many-folded pyramid over a polygon. Multiplexes, but not other ordinary polytopes,...
متن کاملLifting inequalities for polytopes
We present a method of lifting linear inequalities for the flag f -vector of polytopes to higher dimensions. Known inequalities that can be lifted using this technique are the non-negativity of the toric g-vector and that the simplex minimizes the cd-index. We obtain new inequalities for 6-dimensional polytopes. In the last section we present the currently best known inequalities for dimensions...
متن کامل